Simplified Lower Bounds for Propositional Proofs
نویسندگان
چکیده
منابع مشابه
Lower Bounds to the Size of Constant-Depth Propositional Proofs
1 LK is a natural modiication of Gentzen sequent calculus for pro-positional logic with connectives : and V ; W (both of unbounded arity). Then for every d 0 and n 2, there is a set T d n of depth d sequents of total size O(n 3+d) which are refutable in LK by depth d + 1 proof of size exp(O(log 2 n)) but such that every depth d refutation must have the size at least exp(n (1)). The sets T d n e...
متن کاملLower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic (Abstract)
We begin with a highly informal discussion of the role played by Bounded Arithmetic and propositional proof systems in the reasoning about the world of feasible computations. Then we survey some known lower bounds on the complexity of proofs in various propositional proof systems, paying special attention to recent attempts on reducing such bounds to some purely complexity results or assumption...
متن کاملNon-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs
Does every Boolean tautology have a short propositional-calculus proof? Here, a propositionalcalculus (i.e. Frege) proof is any proof starting from a set of axioms and deriving new Boolean formulas using a fixed set of sound derivation rules. Establishing any super-polynomial size lower bound on Frege proofs (in terms of the size of the formula proved) is a major open problem in proof complexit...
متن کاملLower bounds on Nullstellensatz proofs via designs
The Nullstellensatz proof system is a proof system for propositional logic based on algebraic identities in fields. Prior work has proved lower bounds of the degree Nullstellensatz refutations using combinatorial constructions called designs. This paper surveys the use of designs for Nullstellensatz lower bounds. We give a new, more general definition of designs. We present an explicit construc...
متن کاملAutomated Proofs of Time Lower Bounds
A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, MOD6-SAT, Majority-of-Majority-SAT, and Tautologies, to name a few. These lower bound proofs all follow a certain diagonalization-based proof-by-contradiction strategy....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1996
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1040046140